Robust adaptive importance sampling for normal random vectors
نویسندگان
چکیده
منابع مشابه
Robust Adaptive Importance Sampling for Normal Random Vectors
Adaptive Monte Carlo methods are very efficient techniques designed to tune simulation estimators on-line. In this work, we present an alternative to stochastic approximation to tune the optimal change of measure in the context of importance sampling for normal random vectors. Unlike stochastic approximation, which requires very fine tuning in practice, we propose to use sample average approxim...
متن کاملImportance Sampling Techniques for the Multidimensional Ruin Problem for General Markov Additive Sequences of Random Vectors
Let {(Xn, Sn) : n = 0, 1, . . .} be a Markov additive process, where {Xn} is a Markov chain on a general state space and Sn is an additive component on R . We consider P {Sn ∈ A/ , some n} as → 0, where A ⊂ R is open and the mean drift of {Sn} is away from A. Our main objective is to study the simulation of P {Sn ∈ A/ , some n} using the Monte Carlo technique of importance sampling. If the set ...
متن کاملLayered Adaptive Importance Sampling
Monte Carlo methods represent the de facto standard for approximating complicated integrals involving multidimensional target distributions. In order to generate random realizations from the target distribution, Monte Carlo techniques use simpler proposal probability densities for drawing candidate samples. Performance of any such method is strictly related to the specification of the proposal ...
متن کاملSafe Adaptive Importance Sampling
Importance sampling has become an indispensable strategy to speed up optimization algorithms for large-scale applications. Improved adaptive variants—using importance values defined by the complete gradient information which changes during optimization—enjoy favorable theoretical properties, but are typically computationally infeasible. In this paper we propose an efficient approximation of gra...
متن کاملAdaptive Multiple Importance Sampling
The Adaptive Multiple Importance Sampling (AMIS) algorithm is aimed at an optimal recycling of past simulations in an iterated importance sampling scheme. The difference with earlier adaptive importance sampling implementations like Population Monte Carlo is that the importance weights of all simulated values, past as well as present, are recomputed at each iteration, following the technique of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2009
ISSN: 1050-5164
DOI: 10.1214/09-aap595